Efficient Multi-unit Auctions for Normal Goods
نویسندگان
چکیده
I study efficient multi-unit auction design when bidders have private values, multiunit demands, and non-quasilinear preferences. Without quasilinearity, the Vickrey auction loses its desired incentive and efficiency properties. Instead of assuming that bidders have quasilinear preferences, I assume that bidders have positive wealth effects. This nests cases where bidders are risk averse, face financial constraints, or have budgets. With two bidders, I show that there is a mechanism that retains the desirable properties of the Vickrey auction if and only if bidders have single dimensional types. If bidders have multi-dimensional types, there is no mechanism that satisfies (1) individual rationality, (2) dominant strategy incentive compatibility, (3) ex-post Pareto efficiency, and (4) weak budget balance. When there are more than two bidders, I show that there is no mechanism with desirable incentive and efficiency properties, even if bidders have single dimensional types.
منابع مشابه
Overbidding and inefficiencies in multi-unit Vickrey auctions for normal goods
I examine bid behavior in uniform-price auctions and multi-unit Vickrey auctions, without the standard quasilinearity restriction on bidder preferences. Instead of assuming quasilinearity, I assume that bidders have weakly positive wealth effects, i.e. the goods are normal goods. My setting nests quasilinearity, but also allows for budget constraints, financial constraints, and risk aversion. I...
متن کاملComputationally-efficient winner determination for mixed multi-unit combinatorial auctions
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner determination problem is an NP-hard problem that can be mapped into an integer program. Nonetheless, the computational cost of the current solution hinders the application of mixed multi-unit combinatorial auctions to reali...
متن کاملTime constraints in mixed multi-unit combinatorial auctions
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determination problem for such auctions using integer programming. Mixed multi-unit combinatorial auctions are auctions where bidders can offer combinations of transformations of goods rather than just simple goods. This model h...
متن کاملEquilibrium strategies for multi-unit sealed-bid auctions with multi-unit demand bidders
In most of the existing literature on multi-unit auctions, i.e. auctions selling several identical goods together, it is assumed that bidders demand a single item. Yet this assumption is not valid in most practical auction settings, as often bidders wish to purchase multiple goods. Computing equilibrium strategies in multi-unit uniform-price auctions for bidders with multi-unit demand is an ope...
متن کاملNear-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions
We design and analyze deterministic truthful approximation mechanisms for multi-unit combinatorial auctions involving a constant number of distinct goods, each in arbitrary limited supply. Prospective buyers (bidders) have preferences over multisets of items, i.e., for more than one unit per distinct good, that are expressed through their private valuation functions. Our objective is to determi...
متن کاملOn the empirical evaluation of Mixed Multi-Unit Combinatorial Auctions
Mixed Multi-Unit Combinatorial Auctions (MMUCA) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services, and in general the MMUCA extends and generalises all the preceding types of combinatorial auctions. However, lit...
متن کامل